منابع مشابه
Boolean functions with all main cryptographic properties
In this paper, we propose a class of 2k-variable Boolean functions which have optimal algebraic degree, very high nonlinearity, and are 1-resilient. Based on our newly proposed conjecture, it can be shown that the algebraic immunity of our functions is at least suboptimal. Moreover, when k is odd, the algebraic immunity is actually optimal, and for even k, we find that the algebraic immunity is...
متن کاملIsomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
Given two n-variable boolean functions f and g, we study the problem of computing an ε-approximate isomorphism between them. I.e. a permutation π of the n variables such that f(x1, x2, . . . , xn) and g(xπ(1), xπ(2), . . . , xπ(n)) differ on at most an ε fraction of all boolean inputs {0, 1}. We give a randomized 2 √ n polylog(n)) algorithm that computes a 1 2polylog(n) -approximate isomorphism...
متن کاملStratification and enumeration of Boolean functions by canalizing depth
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively “picked off”, until a non-canalizing function remains. In this paper, w...
متن کاملNew balanced Boolean functions satisfying all the main cryptographic criteria
We study an infinite class of functions which provably achieve an optimum algebraic immunity, an optimum algebraic degree and a good nonlinearity. We checked that it has also a good behavior against fast algebraic attacks.
متن کاملOn Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions
We consider new complexity measures for the model of multilinear circuits with general multilinear gates introduced by Goldreich and Wigderson (ECCC, 2013). These complexity measures are related to the size of canonical constant-depth Boolean circuits, which extend the definition of canonical depth-three Boolean circuits. We obtain matching lower and upper bound on the size of canonical constan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1977
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0206026